Generalized Hamming graphs: some new results

Some New Results on Stochastic Orderings between Generalized Order Statistics

In this paper we specify the conditions on the parameters of pairs of gOS’s under which the corresponding generalized order statistics are ordered according to usual stochastic ordering, hazard rate ordering, likelihood ratio ordering and dispersive ordering. We consider this problem in one-sample as well as two-sample problems. We show that some of the results obtained by Franco et al. ...

Some new results on circle graphs

Abstract: The intersection graph of a set of chords on a circle is called a circle graph. This class of graphs admits some interesting subclasses, such as: Helly circle graphs, clique-Helly circle graphs, unit circle graphs and proper circular-arc graphs. In this paper, we prove some inclusion relations among these subclasses. A necessary condition for a graph being a Helly circle graph is show...

The Second Generalized Hamming Weight of Some Evaluation Codes Arising from Complete Bipartite Graphs

In this paper we compute the second generalized Hamming weight of the evaluation codes associated to complete bipartite graphs. The main result depends on the minimum distance and second generalized Hamming weight of the generalized Reed-Solomon codes.

Some Results in Generalized Serstnev Spaces

Further results on odd mean labeling of some subdivision graphs

Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...